SPOT: An Extensible Model Checking Library Using Transition-Based Generalized Büchi Automata
نویسندگان
چکیده
Spot is a C++ library offering model checking bricks that can be combined and interfaced with third party tools to build a model checker. It relies on Transition-based Generalized Büchi Automata (TGBA) and does not need to degeneralize these automata to check their emptiness. We motivate the choice of TGBA by illustrating a very simple (yet efficient) translation of LTL into TGBA. We then show how it supports on-the-fly computations, and how it can be extended or integrated in other tools.
منابع مشابه
Symbolic Model Checking of Stutter-Invariant Properties Using Generalized Testing Automata
In a previous work, we showed that a kind of ω-automata known as Transition-based Generalized Testing Automata (TGTA) can outperform the Büchi automata traditionally used for explicit model checking when verifying stutter-invariant properties. In this work, we investigate the use of these generalized testing automata to improve symbolic model checking of stutter-invariant LTL properties. We pro...
متن کاملOn-the-fly Emptiness Check of Transition-Based Streett Automata
In the automata theoretic approach to model checking, checking a state-space S against a linear-time property φ can be done in O(|S| × 2) time. When model checking under n strong fairness hypotheses expressed as a Generalized Büchi automaton, this complexity becomes O(|S| × 2). Here we describe an algorithm to check the emptiness of Streett automata, which allows model checking under n strong f...
متن کاملEfficient Translation from Transition-Based Generalized Büchi Automata to Büchi Automata
The automata-theoretic approach is one of the state-of-the-art model-checking methods, which consists of the following steps: use a Büchi automaton to represent the abstract system model; use an LTL formula to express the properties to be verified; translate the negation of the LTL formula to a Büchi automaton and check whether the intersection of sentences accepted by the two automata is non-e...
متن کاملModel Checking Using Generalized Testing Automata
Geldenhuys and Hansen showed that a kind of ω-automata known as Testing Automata (TA) can, in the case of stuttering-insensitive properties, outperform the Büchi automata traditionally used in the automata-theoretic approach to model checking [10]. In previous work [23], we compared TA against Transition-based Generalized Büchi Automata (TGBA), and concluded that TA were more interesting when c...
متن کاملEmptiness of Linear Weak Alternating Automata
The automata-theoretic approach to model checking requires two basic ingredients: a translation from logic to automata, and an algorithm for checking language emptiness. LTL model checking has traditionally been based on (generalized) Büchi automata. Weak alternating automata provide an attractive alternative because there is an elegant and linear-time translation from LTL. However, due to thei...
متن کامل